Managed Agreement: Generalizing two fundamental distributed agreement problems
نویسندگان
چکیده
منابع مشابه
Managed Agreement: Generalizing two fundamental distributed agreement problems
Consensus and Non-Blocking Atomic Commit (NBAC) are two fundamental distributed problems. The specifications of both problems may lead one to think that they are very similar. However, a black-box solution to any of them is not sufficient to solve the other. This paper presents a family of agreement problems called Managed Agreement, which is parameterized by the number of aristocrat nodes in t...
متن کاملMastering Agreement Problems in Distributed Systems
0 7 4 0 7 4 5 9 / 0 1 / $ 1 0 . 0 0 © 2 0 0 1 I E E E crashing. This problem lends itself to further exploration of fundamental mechanisms and concepts such as time-out, multicast, consensus, and failure detector. We will survey recent theoretical results of studies related to agreement problems and show how system engineers can use this information to gain deeper insight into the challenges th...
متن کاملDistributed Anonymous Mobile Robots | Formation and Agreement Problems ?
Consider a system of multiple mobile robots in which each robot, at innnitely many unpredictable time instants, observes the positions of all the robots and moves to a new position determined by the given algorithm. The robots are anonymous in the sense that they all execute the same algorithm and they cannot be distinguished by their appearances. The robots are not necessarily synchronous, and...
متن کاملWeak System Models for Fault-Tolerant Distributed Agreement Problems
This thesis1 investigates various aspects of weak system models for agreement problems in fault-tolerant distributed computing. In Part I we provide an introduction to the context of this work, discuss related literature and describe the basic system assumptions. In Part II of this thesis, we introduce the Asynchronous Bounded-Cycle (ABC) model, which is entirely time-free. In contrast to exist...
متن کاملThe Notion of Veto Number for Distributed Agreement Problems
This paper introduces the notion of veto number that can be associated with agreement problems. An agreement problem has veto number l when l is the minimal number of processes that control the allowed decision values, i.e., if each of them changes its mind on the value it proposes, then it forces deciding on a different value. The paper presents and investigates this concept. Key-words: Agreem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2007
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2006.10.001